Rationalizable voting

نویسنده

  • Tasos Kalandrakis
چکیده

We derive necessary and sufficient conditions in order for binary voting choices over a finite number of pairs of alternatives to be consistent with voter preferences that admit concave utility representations. These conditions imply simple testable restrictions on the location of voters’ ideal points, and can be used to predict individual voting behavior. On the other hand, if the location of voting alternatives is unrestricted then voting decisions impose no testable restrictions on voter ideal points, even if the space of alternatives in one dimensional. Finally, we show that two dimensions are always sufficient to represent any voting records and voters with strictly concave utility representations and arbitrary ideal points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Rationalization of Distance Rationalizability

Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...

متن کامل

Rationalizing Distance Rationalizability

Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a rationalizable voting rule selects an alternative that is closest to being a consensus winner. Despite its appeal, distance rationalizability faces the challenge of connecting the chosen distance measure and consensus notion ...

متن کامل

Strategyproof approximations of distance rationalizable voting rules

This paper considers randomized strategyproof approximations to distance rationalizable voting rules. It is shown that the Random Dictator voting rule (return the top choice of a random voter) nontrivially approximates a large class of distances with respect to unanimity. Any randomized voting rule that deviates too greatly from the Random Dictator voting rule is shown to obtain a trivial appro...

متن کامل

Homogeneity and monotonicity of distance-rationalizable voting rules

Distance rationalizability is a framework for classifying existing voting rules by interpreting them in terms of distances and consensus classes. It also allows to design new voting rules with desired properties. A particularly natural and versatile class of distances that can be used for this purpose is that of votewise distances [EFS10b], which “lift” distances over individual votes to distan...

متن کامل

Centre de Referència en Economia Analítica

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007